Nearly optimal robust secret sharing
نویسندگان
چکیده
منابع مشابه
An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency
In this paper, we consider the problem of (t, δ) robust secret sharing secure against rushing adversary. We design a simple t-out-ofn secret sharing scheme, which can reconstruct the secret in presence of t cheating participants except with probability at most δ, provided t < n/2. The later condition on cheater resilience is optimal for the case of public reconstruction of the secret, on which ...
متن کاملA robust Optimal Zero-Watermarking Technique for Secret Watermark Sharing
In this paper, a robust optimal zero-watermarking technique based on genetic algorithm for secret watermark sharing is proposed for the purpose of copyright protection. It is implemented in discrete cosine transform (DCT) for gray scale images in which the visual secret sharing is used to generate unexpanded master and secret shares for the watermark. The GA based zero watermarking is used to s...
متن کاملEssentially Optimal Robust Secret Sharing with Maximal Corruptions
In a t-out-of-n robust secret sharing scheme, a secret message is shared among n parties who can reconstruct the message by combining their shares. An adversary can adaptively corrupt up to t of the parties, get their shares, and modify them arbitrarily. The scheme should satisfy privacy, meaning that the adversary cannot learn anything about the shared message, and robustness, meaning that the...
متن کاملEssentially Optimal Robust Secret Sharing with Maximal Corruptions
In a t-out-of-n robust secret sharing scheme, a secret message is shared among n parties who can reconstruct the message by combining their shares. An adversary can adaptively corrupt up to t of the parties, get their shares, and modify them arbitrarily. The scheme should satisfy privacy, meaning that the adversary cannot learn anything about the shared message, and robustness, meaning that the...
متن کاملRobust Password-Protected Secret Sharing
Password-protected secret sharing (PPSS) schemes allow a user to publicly share its high-entropy secret across different servers and to later recover it by interacting with some of these servers using only his password without requiring any authenticated data. In particular, this secret will remain safe as long as not too many servers get corrupted. However, servers are not always reliable and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2018
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-018-0578-y